Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values
نویسندگان
چکیده
Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial f(X) ∈ Z[X] from approximate values of the residues of f(t) modulo a prime p at polynomially many points t taken from a short interval.
منابع مشابه
Analysis of Accuracy of Interpolation Methods in Estimating the Output Factors for Square Fields in Medical Linear Accelerator
Introduction: To estimate the accuracy levels of Lagrange, Newton backward interpolation, and linear interpolation methods in estimating the output factors for square fields used in linear accelerator for 6 MV photons at various depths. Materials and Methods: Ionization measurements were carried out in radiation field analyzer in linear accelerator for 6 MV beams at the depths of 5 and 10 cm by...
متن کاملIdentity Testing and Interpolation from High Powers of Polynomials of Large Degree over Finite Fields
We consider the problem of identity testing and recovering (that is, interpolating) of a “hidden” monic polynomials f , given an oracle access to f(x) for x ∈ Fq , where Fq is the finite field of q elements and an extension fields access is not permitted. The naive interpolation algorithm needs de + 1 queries, where d = max{deg f, deg g} and thus requires de < q . For a prime q = p , we design ...
متن کاملPower sums of polynomials over finite fields and applications: A survey
In this brief expository survey, we explain some results and conjectures on various aspects of the study of the sums of integral powers of monic polynomials of a given degree over a finite field. The aspects include non-vanishing criteria, formulas and bounds for degree and valuation at finite primes, explicit formulas of various kind for the sums themselves, factorizations of such sums, genera...
متن کاملA Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show that it is possible to find an n-variable interpolating polynomial with at most t terms, using the number of field operations that is polynomial in t and n. The algorithm exploits the structure of the multivariate gen...
متن کاملA C1-p2 Finite Element without Nodal Basis
A new finite element, which is continuously differentiable, but only piecewise quadratic polynomials on a type of uniform triangulations, is introduced. We construct a local basis which does not involve nodal values nor derivatives. Different from the traditional finite elements, we have to construct a special, averaging operator which is stable and preserves quadratic polynomials. We show the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 23 شماره
صفحات -
تاریخ انتشار 2014